| 翻訳と辞書 |
| list of computability and complexity topics ： ウィキペディア英語版 |
list of computability and complexity topics
This is a list of computability and complexity topics, by Wikipedia page.
Computability theory is the part of the theory of computation that deals with what can be computed, in principle. Computational complexity theory deals with how hard computations are, in quantitative terms, both with upper bounds (algorithms whose complexity in the worst cases, as use of computing resources, can be estimated), and from below (proofs that no procedure to carry out some task can be very fast).
For more abstract foundational matters, see the list of mathematical logic topics. See also list of algorithms, list of algorithm general topics.
==Calculation==
*Lookup table
*
*Mathematical table
*
*Multiplication table
*
*Generating trigonometric tables
*History of computers
*Multiplication algorithm
*
*Peasant multiplication
*Division by two
*Exponentiating by squaring
*Addition chain
*
*Scholz conjecture
*Presburger arithmetic
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「list of computability and complexity topics」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|